Efficiency of Four Virtual LANs Switches with Equal Processing Times
نویسندگان
چکیده
منابع مشابه
Parallel Machine Problems with Equal Processing Times
The basic scheduling problem we are dealing with is the following. There are n jobs, each requiring an identical execution time. All jobs have to be processed on a set of parallel machines. Preemptions can be either allowed or forbidden. The aim is to construct a feasible schedule such that a given criterion is minimized. For a couple of problems of this type, recently the complexity status has...
متن کاملScheduling Jobs with Equal Processing Times
Whereas the overwhelming majority of scheduling problems appears to be NP-hard, models with equal processing time jobs form a remarkable case which is still open for most problems but it intuitively looks polynomially solvable. The basic scheduling problem we are dealing with is the following. There are n jobs, each requiring an identical execution time p. There are associated a release time rj...
متن کاملVariants of Multi-resource Scheduling Problems with Equal Processing Times
We tackle the problem of non-preemptive scheduling of a set of tasks of duration p over m machines with given release and deadline times. We present a polynomial time algorithm as a generalization to this problem, when the number of machines fluctuates over time. Further, we consider different objective functions for this problem. We show that if an arbitrary function cost ci(t) is associated t...
متن کاملParallel machine problems with equal processing times: a survey
The basic scheduling problem we are dealing with is the following. There are n jobs, each requiring an identical execution time. All jobs have to be processed on a set of parallel machines. Preemptions can be either allowed or forbidden. The aim is to construct a feasible schedule such that a given criterion is minimized. For a couple of problems of this type, recently the complexity status has...
متن کاملOn a parallel machine scheduling problem with equal processing times
In this paper, we give a polynomial algorithm for problem P | r j , p j = p | f j (C j), where f j is any non-decreasing function such that for any indices i and j, function f i − f j is monotonous, and a polynomial algorithm for problem P | r j , p j = p, D j | max ϕ j (C j), where ϕ j is any non-decreasing function for any j.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: AL-Rafidain Journal of Computer Sciences and Mathematics
سال: 2011
ISSN: 2311-7990
DOI: 10.33899/csmj.2011.163615